Tham khảo Treap

  1. ↑ Aragon, Cecilia R.; Seidel, Raimund (1989), “Randomized Search Trees”, [[Symposium on Foundations of Computer Science|Proc. 30th Symp. Foundations of Computer Science (FOCS 1989)]] (PDF), Washington, D.C.: IEEE Computer Society Press, tr. 540–545, doi:10.1109/SFCS.1989.63531, ISBN 0-8186-1982-1 Tựa đề URL chứa liên kết wiki (trợ giúp)
  2. ↑ Seidel, Raimund; Aragon, Cecilia R. (1996), “Randomized Search Trees”, Algorithmica, 16 (4/5): 464–497, doi:10.1007/s004539900061
  3. ↑ Vuillemin, Jean (1980), “A unifying look at data structures”, Commun. ACM, New York, NY, USA: ACM, 23 (4): 229–239, doi:10.1145/358841.358852.
  4. ↑ Blelloch, Guy E.,; Reid-Miller, Margaret, (1998), “Fast set operations using treaps”, Proc. 10th ACM Symp. Parallel Algorithms and Architectures (SPAA 1998), New York, NY, USA: ACM, tr. 16–26, doi:10.1145/277651.277660, ISBN 0-89791-989-0Quản lý CS1: dấu chấm câu dư (liên kết).
  5. ↑ Naor, M.; Nissim, K. (2000), “Certificate revocation and certificate update” (PDF), IEEE Journal on Selected Areas in Communications, 18 (4): 561–570, doi:10.1109/49.839932 Đã bỏ qua tham số không rõ |month= (trợ giúp).

Tài liệu tham khảo

WikiPedia: Treap http://www.fernando-rodriguez.com/a-high-performan... http://code.google.com/p/as3-commons/source/browse... http://code.google.com/p/treapdb/ http://www.ibr.cs.tu-bs.de/lehre/ss98/audii/applet... http://citeseer.ist.psu.edu/viewdoc/summary?doi=10... http://www.cs.uiuc.edu/class/sp09/cs473/notes/08-t... http://faculty.washington.edu/aragon/pubs/rst89.pd... http://faculty.washington.edu/aragon/treaps.html http://stromberg.dnsalias.org/~dstromberg/treap/ //doi.org/10.1007%2Fs004539900061